Power Residues and Nonresidues in Arithmetic Progressions
نویسنده
چکیده
Let A: be an integer > 2 andp a prime such that vk(p) = (k,p — 1) > 1. Let bn + c(n = 0,1,. ..;b > 2,1 < c < b, (b,p) — (c,p) = 1) be an arithmetic progression. We denote the smallest kth power nonresidue in the progression bn + c by g(p,k,b,c), the smallest quadratic residue in the progression bn + c by r2(p,b,c), and the nth smallest prime kth power nonresidue by g„(p,k), n = 0, 1, 2,_ If C(p) is the multiplicative group consisting of the residue classes mod p, then the fcth powers mod p form a multiplicative subgroup, Ck(p). Among the vk(p) cosets of Ck(p) denote by T the coset to which c belongs (where c is the first term in the progression bn + c), and let h(p,k,b,c) denote the smallest number in the progression bn + c which does not belong to Tso that h(p,k,b,c) is a natural generalization of g(p,k,b,c). We prove by purely elementary methods that h(p, k, b, c) is bounded above by 2V*b5/2p2/5 + 3b3pv> + b2 if p is a prime for which either b or p 1 is a kth power nonresidue. The restriction on b and p 1 may be lifted if p > (g\(p,k))ls. We further obtain a similar bound for r2(p,b,c) for every prime p, without exception, and we apply our results to obtain a bound of the order of p2/5 for the nth smallest prime A:th power nonresidue of primes which are large relative to UJ"—1 gj(p>k)
منابع مشابه
On rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملPowerful Arithmetic Progressions
We give a complete characterization of so called powerful arithmetic progressions, i.e. of progressions whose kth term is a kth power for all k. We also prove that the length of any primitive arithmetic progression of powers can be bounded both by any term of the progression different from 0 and ±1, and by its common difference. In particular, such a progression can have only finite length.
متن کاملAveraging Effects on Irregularities in the Distribution of Primes in Arithmetic Progressions
Let t be an integer taking on values between 1 and x (x real), let irhc(t) denote the number of positive primes < t which are s c (mod b), and let li t denote the usual integral logarithm of /. Further, let the ratio of quadratic nonresidues of b > 2 to quadratic residues of bbey(b) to 1, and let l/ * * , Ah(x) = (i/y(b))-\ £ n.c(0-r(») L "i,X>)\ M<c<*-1 l«c'<Ä-l ' where c runs over quadratic n...
متن کاملCS 880 : Advanced Complexity Theory 3 / 31 / 2008 Lecture 24 : Additive Combinatorics
A random A yields A+A of size closer to the high end of |A|2. Furthermore, any set A whose members are sufficiently separated has |A+A| close to this high end, and the high end is actually tight for sets A that are geometric progressions, e.g. the first n powers of two. What about the low end of |A|: what is the structure of sets A where |A+A| is close to |A|? We can see that this low-end estim...
متن کاملGeneralizations of a Classical Theorem in Number Theory
A classical theorem conjectured by Jacobi asserts that for an odd prime p, the sum of the quadratic residues in the interval (0, p) is less than the sum of the quadratic nonresidues if and only if p ■ 3 (mod 4). We generalize Jacobi's problem to fcth powers (mod p), k > 2, and we consider in some detail a generalization of Jacobi's conjecture to quadratic residues and nonresidues (mod n), n an ...
متن کامل